منابع مشابه
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs
For digraphs D and H , a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). For a fixed directed or undirected graph H and an input graph D, the problem of verifying whether there exists a homomorphism of D to H has been studied in a large number of papers. We study an optimization version of this decision problem. Our optimization problem is motivated by ...
متن کاملAlmost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6= y of vertices such that both xy and yx are in D. Almost minimum diameter orientations of certain semicomplete multipartite and extended digraphs are considered, several generalizations of results on orientations of undirected graphs are obtained, some conje...
متن کاملSTOCHASTIC VARIATIONAL APPROACH TO MINIMUM UNCERTAINTY STATES Short title: STOCHASTIC VARIATIONAL APPROACH TO MINIMUM UNCERTAINTY
We introduce a new variational characterization of Gaussian diffusion processes as minimum uncertainty states. We then define a variational method constrained by kinematics of diffusions and Schrödinger dynamics to seek states of local minimum uncertainty for general non-harmonic potentials. PACS numbers:03.65.-w, 03.65.Ca, 03.65.Bz
متن کاملExperimental joint quantum measurements with minimum uncertainty.
Quantum physics constrains the accuracy of joint measurements of incompatible observables. Here we test tight measurement-uncertainty relations using single photons. We implement two independent, idealized uncertainty-estimation methods, the three-state method and the weak-measurement method, and adapt them to realistic experimental conditions. Exceptional quantum state fidelities of up to 0.99...
متن کاملComputing Minimum Spanning Trees with Uncertainty
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the graph only a set Ae, called an uncertainty area, that contains the actual edge weight we is known. The algorithm can ‘update’ e to obtain the edge weight we ∈ Ae. The task is to output the edge set of a minimum spanning tree after...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2012
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.86.042124